1848C - Vika and Price Tags - CodeForces Solution


greedy math number theory

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define no cout<<"No"<<"\n"
#define yes cout<<"Yes"<<"\n"
constexpr int mod=998244353;
constexpr int N=2e5+30;
void work(){
	int n;
	cin>>n;
	vector<int> a(n);
	vector<int> b(n);
	for(int i=0;i<n;++i){
		cin>>a[i];
	}
	for(int i=0;i<n;++i){
		cin>>b[i];
	}
	vector<bool> v(3,false);
	int cnt=0;
	for(int i=0;i<n;++i){
		if(a[i]==0&&b[i]==0)	continue;
		while(a[i]%2==0&&b[i]%2==0){
			a[i]/=2,b[i]/=2;
		}
		if(a[i]%2==1&&b[i]%2==0)	v[0]=true;
		else if(a[i]%2==0&&b[i]%2==1)	v[1]=true;
		else v[2]=true;
	}
	for(int i=0;i<3;++i)	cnt+=(v[i]==true);
	cout<<(cnt<=1?"Yes":"No")<<"\n";
	return ;
}
signed main(){
	IOS;
	int TT;
	cin>>TT;
	while(TT--)
		work();
	return 0;
}


Comments

Submit
0 Comments
More Questions

1041A - Heist
901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro
780C - Andryusha and Colored Balloons
1153A - Serval and Bus
1487C - Minimum Ties
1136A - Nastya Is Reading a Book
1353B - Two Arrays And Swaps
1490E - Accidental Victory
1335A - Candies and Two Sisters
96B - Lucky Numbers (easy)
1151B - Dima and a Bad XOR
1435B - A New Technique
1633A - Div 7
268A - Games
1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection